Dominance Solvability in Random Games

We study the effectiveness of iterated elimination strictly-dominated actions in random games. show that dominance solvability games is vanishingly small as number at least one player's grows. Furthermore, conditional on solvability, iterations required to converge Nash equilibrium grows rapidly action sets grow. Nonetheless, when are highly imbalanced, simplifies game substantially by ruling out a sizable fraction actions. Technically, we illustrate usefulness recent combinatorial methods for analysis general